A Generalization of Circulant Matrices for Non-Abelian Groups

نویسنده

  • Kent E. Morrison
چکیده

A circulant matrix of order n is the matrix of convolution by a fixed element of the group algebra of the cyclic group Zn. Replacing Zn by an arbitrary finite group G gives the class of matrices that we call G-circulant. We determine the eigenvalues of such matrices with the tools of representation theory and the non-abelian Fourier transform. Definition 1 An n by n matrix C is circulant if there exist c0, . . . , cn−1 such that the i, j entry of C is ci−j mod n, where the rows and columns are numbered from 0 to n − 1 and k mod n means the number between 0 and n− 1 that is congruent to k modulo n. For n = 5 a circulant matrix looks like  c0 c4 c3 c2 c1 c1 c0 c4 c3 c2 c2 c1 c0 c4 c3 c3 c2 c1 c0 c4 c4 c3 c2 c1 c0  Definition 2 Let G = {σ1, . . . , σn} be a finite group of order n. An n by n matrix C is G-circulant (with respect to the ordering of G) if the entry in row i and column j is a function of σiσ j . A circulant matrix is a Zn-circulant matrix with the ordering Zn = {0, 1, . . . , n − 1}. We call a matrix group-circulant if it is G-circulant for some group G and an ordering of the elements of G. Group-circulant matrices naturally arise as the transition matrices of Markov chains on finite groups. The state space is G and the probability of moving from τ to στ is pσ.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrices of Finite Abelian Groups, Finite Fourier Transform and Codes

Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of cyclic groups. In this regard, we introduce a generalization of the previous investigations to the case of finite groups, abelian or not. We make clear the p...

متن کامل

The spectra of random abelian G-circulant matrices

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between circulant matrices and cyclic groups. It is shown that, under mild conditions, when the size of the group G goes to infinity, the spectral measures of such random ma...

متن کامل

Circulant Hadamard Matrices

Note. The determinant of a circulant matrix is an example of a group determinant, where the group is the cyclic group of order n. In 1880 Dedekind suggested generalizing the case of circulants (and more generally group de­ terminants for abelian groups) to arbitrary groups. It was this suggestion that led Frobenius to the creation group of representation theory. See [1] and the references therein.

متن کامل

Tensors as module homomorphisms over group rings

Braman [1] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear transformations over vectors with real-valued scalars. This result is based upon a circulant-based tensor multiplication due to Kilmer et al. [4]. In this work,...

متن کامل

Computation of the q-th roots of circulant matrices

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008